An Algorithm for Posynomial Geometric Programming, Based on Generalized Linear Programming
نویسندگان
چکیده
This paper describes a column generation algorithm for posynomial geometric programming which is based on Dantzig’s generalized linear programming principle. The algorithm works on the dual problem and avoids the traditional computational problems associated with dual-based algorithms. Test results indicate that the algorithm is extremely robust and can be used successfully to solve large-scale geometric programming problems on a microcomputer.
منابع مشابه
Posynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملGlobal optimization of fractional posynomial geometric programming problems under fuzziness
In this paper we consider a global optimization approach for solving fuzzy fractional posynomial geometric programming problems. The problem of concern involves positive trapezoidal fuzzy numbers in the objective function. For obtaining an optimal solution, Dinkelbach’s algorithm which achieves the optimal solution of the optimization problem by means of solving a sequence of subproblems ...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Multi Objective Geometric Programming Model for Optimal Production and Marketing Planning
This paper presents a multi objective geometric programming model which determines the product`s selling price in two markets. We assume demand is a function of price and marketing expenditure in two markets. The cost of production is also assumed to be a function of demands in both markets. Our model is a posynomial function which is solved using Geometric Programming (GP). In our GP implement...
متن کاملThe proximity of (algebraic) geometric programming to linear programming
Geometric programming with (posy)monomials is known to be synonomous with linear programming, Ifais note reduces algebraic programming to geometric programming with (posy)binomials. Carnegie-Mellon University, Pittsburgh, Pennsylvania, 15213. Partially supported by the Army under research grant DA--AROD-31-124-71-G17. Northwestern University, Evanston, Illinois, 60201. Partially supported by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995